An Enumeration of Binary Self-Dual Codes of Length 32
نویسندگان
چکیده
A binary self-dual code of length 2k is a (2k, k) binary linear code C with the property that every pair of codewords in C are orthogonal. Two self-dual codes, C1 and C2, are equivalent if and only if there is a permutation of the coordinates of C1 that takes C1 into C2. The automorphism group of a binary code C is the set of all permutations of the coordinates of C that takes C into itself. The main topic of this paper is the enumeration of inequivalent binary self-dual codes. We have developed algorithms that will take lists of inequivalent small codes and produce lists of larger codes where each inequivalent code occurs only a few times. We have defined a canonical form for codes that allowed us to eliminate the overenumeration. So we have lists of inequivalent binary self-dual codes of length up to 32. The enumeration of the length 32 codes is new. Our algorithm also finds the size of the automorphism group so that we can compute the number of distinct binary self-dual codes for a specific length. This number can also be found by counting and matches our total.
منابع مشابه
On the Enumeration of Binary Self-Dual Codes
We give a classification of singly-even self-dual binary codes of length 32, by enumerating all neighbours of the known 85 doublyeven self-dual binary codes of length 32. There are 3, 210 singly-even self-dual binary codes of length 32 up to equivalence. This agrees in number with the enumeration by Bilous and van Rees, who enumerated these codes by a different method.
متن کاملThe Binary Self-Dual Codes of Length up to 32: A Revised Enumeration
This paper presents a revised enumeration of the binary self-dual codes of length up to 32 given by Conway and Pless in 1978-1980. The list of 85 doubly-even selfdual codes of length 32 is essentially correct, but several of their descriptions need amending. The principal change is that there are 731 (not 664) inequivalent selfdual codes of length 30. Furthermore, there are three (not two) [28,...
متن کاملEnumeration of the Binary Self-Dual Codes of Length 34
An (n, k) binary self-orthogonal code is an (n, k) binary linear code C that is contained in its orthogonal complement C⊥. A self-orthogonal code C is self-dual if C = C⊥. Two codes, C1 and C2, are equivalent if and only if there exists a coordinate permutation of C1 that takes C1 into C2. The automorphism group of a code C is the set of all coordinate permutations of C that takes C into itself...
متن کاملNew extremal binary self-dual codes of length 68 via short kharaghani array over f_2 + uf_2
In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F2 + uF2 and self-dual Type I [64, 32, 12]2-codes with various weight enumerators obtained as Gray images. By the use of an extension theorem for self-dual codes we...
متن کاملSome Results on Type IV Codes Over
Dougherty, Gaborit, Harada, Munemasa, and Solé have previously given an upper bound on the minimum Lee weight of a Type IV self-dual -code, using a similar bound for the minimum distance of binary doubly even self-dual codes. We improve their bound, finding that the minimum Lee weight of a Type IV self-dual -code of length is at most 4 12 , except when = 4, and = 8 when the bound is 4, and = 16...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 26 شماره
صفحات -
تاریخ انتشار 2002